Genetic Programming for Cooperative Single-Objective Optimization
نویسندگان
چکیده
منابع مشابه
Using traceless genetic programming for solving multi-objective optimization problems
Traceless Genetic Programming (TGP) is a Genetic Programming (GP) variant that is used in the cases where the focus is rather the output of the program than the program itself. The main difference between TGP and other GP techniques is that TGP does not explicitly store the evolved computer programs. Two genetic operators are used in conjunction with TGP: crossover and insertion. In this paper ...
متن کاملMulti-objective Genetic Programming for Visual Analytics
Visual analytics is a human-machine collaboration to data modeling where extraction of the most informative features plays an important role. Although feature extraction is a multi-objective task, the traditional algorithms either only consider one objective or aggregate the objectives into one scalar criterion to optimize. In this paper, we propose a Pareto-based multi-objective approach to fe...
متن کاملGenetic algorithm for multi-objective experimental optimization
A new software tool making use of a genetic algorithm for multi-objective experimental optimization (GAME.opt) was developed based on a strength Pareto evolutionary algorithm. The software deals with high dimensional variable spaces and unknown interactions of design variables. This approach was evaluated by means of multi-objective test problems replacing the experimental results. A default pa...
متن کاملCellular Genetic Algorithm for Multi-Objective Optimization
In this paper, we show how cellular structures can be combined with a multi-objective genetic algorithm (MOGA) for improving its search ability to find Pareto-optimal solutions of multi-objective optimization problems. We propose an assignment method of a different search direction to each cell for implementing a cellular MOGA. In our cellular MOGA, every individual in each population exists in...
متن کاملAdaptive representation for single objective optimization
A new technique called Adaptive Representation Evolutionary Algorithm (AREA) is proposed in this paper. AREA involves dynamic alphabets for encoding solutions. The proposed adaptive representation is more compact than binary representation. Genetic operators are usually more aggressive when higher alphabets are used. Therefore the proposed encoding ensures an efficient exploration of the search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2015
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.28.173